YES 0.46 H-Termination proof of /home/matraf/haskell/eval_FullyBlown_Fast/empty.hs
H-Termination of the given Haskell-Program with start terms could successfully be proven:



HASKELL
  ↳ BR

mainModule Main
  ((max :: Bool  ->  Bool  ->  Bool) :: Bool  ->  Bool  ->  Bool)

module Main where
  import qualified Prelude



Replaced joker patterns by fresh variables and removed binding patterns.

↳ HASKELL
  ↳ BR
HASKELL
      ↳ COR

mainModule Main
  ((max :: Bool  ->  Bool  ->  Bool) :: Bool  ->  Bool  ->  Bool)

module Main where
  import qualified Prelude



Cond Reductions:
The following Function with conditions
max x y
 | x <= y
 = y
 | otherwise
 = x

is transformed to
max x y = max2 x y

max1 x y True = y
max1 x y False = max0 x y otherwise

max0 x y True = x

max2 x y = max1 x y (x <= y)

The following Function with conditions
undefined 
 | False
 = undefined

is transformed to
undefined  = undefined1

undefined0 True = undefined

undefined1  = undefined0 False



↳ HASKELL
  ↳ BR
    ↳ HASKELL
      ↳ COR
HASKELL
          ↳ Narrow

mainModule Main
  (max :: Bool  ->  Bool  ->  Bool)

module Main where
  import qualified Prelude



Haskell To QDPs